Nuprl Lemma : ecl-halt-unique 11,40

ds:fpf(Id; x.Type), da:fpf(Knd; k.Type), x:ecl(dsda), L,L':(event-info(ds;da) List), n,m:.
(ecl-halt(dsdax)(n,L))
 (ecl-halt(dsdax)(m,L'))
 compat(event-info(ds;da); LL')
 guard(((L = L' (n = m  ))) 
latex


Definitions||as||, Y, reduce(fkas), concat(ll), if b then t else f fi , ff, tt, null(as), b, ge(ij), compat(Tl1l2), False, A, A  B, , sq_type(T), P  Q, A c B, spreadn(ax,y,z.t(x;y;z)), True, T, P  Q, P  Q, subtype(ST), top, event-info(ds;da), guard(T), xt(x), t  T, prop{i:l}, P  Q, P  Q, x:AB(x), l_exists(LTx.P(x)), star-append(TPQ), decidable(P), l_all(LTx.P(x)), iseg(Tl1l2), append(asbs), ma-valtype(dak), x:AB(x), x(s), ecl-halt(dsdax)
Lemmasecl-halt-nil, non neg length, length-append, iseg append, false wf, l all cons, ge wf, nat properties, l all wf2, length wf1, concat wf, iseg antisymmetry, compat symmetry, compat-iseg, decidable lt, iseg weakening, iseg transitivity, common iseg compat, le wf, iseg wf, iseg append0, subtype rel self, Knd sq, assert wf, not wf, cons member, l member wf, or functionality wrt iff, member append, append assoc, true wf, squash wf, compat-cons, compat-append2, append wf, append nil sq, Kind-deq wf, fpf-cap wf, compat-append, member wf, top wf, length wf nat, Id wf, Knd wf, fpf wf, eclcatch wf, eclthrow wf, eclact wf, eclrepeat wf, eclor wf, ecland wf, eclseq wf, bool wf, ma-valtype wf, decl-state wf, eclbase wf, ecl wf, guard wf, compat wf, ecl-halt wf, nat wf, event-info wf, ecl-induction

origin